On Equivalent Color Transform and Four Coloring Theorem
نویسنده
چکیده
In this paper, we apply an equivalent color transform (ECT) for a minimal k-coloring of any graph G. It contracts each color class of the graph to a single vertex and produces a complete graph Kk for G by removing redundant edges between any two vertices. Based on ECT, a simple proof for four color theorem for planar graph is then proposed.
منابع مشابه
Color-induced subgraphs of Grünbaum colorings of triangulations of the sphere
A Grünbaum coloring of a triangulation is an assignment of colors to edges so that the edges about each face are assigned unique colors. In this paper we examine the color induced subgraphs given by a Grünbaum coloring of a triangulation and show that the existence of connected color induced subgraphs is equivalent to the Three Color Theorem. A triangulation of an orientable surface is an embed...
متن کاملOn signed diagonal flip sequences
Eliahou [1] and Kryuchkov conjectured a proposition that Gravier and Payan [4] proved to be equivalent to the Four Color Theorem. It states that any triangulation of a polygon can be transformed into another triangulation of the same polygon by a sequence of signed diagonal flips. It is well known that any pair of polygonal triangulations are connected by a sequence of (non-signed) diagonal fli...
متن کاملThe chromatic class and the chromatic number of the planar conjugated triangulation
This material is dedicated to the estimation of the chromatic number and class of the conjugated triangulation and of the second conversion of the planar triangulation. This estimation may through some light on the difficulties, connected with the proof of Four Color Problem. Also this paper introduces some new hypotheses, which are equivalent to Four Color Problem.
متن کاملIt Appears That Four Colors Suffice: A Historical Overview of the Four-Color Theorem
Certainly any mathematical theorem concerning the coloring of maps would be relevant and widely applicable to modern-day cartography. As for the FourColor Theorem, nothing could be further from the truth. Kenneth May, a twentieth century mathematics historian, explains that “books on cartography and the history of map-making do not mention the four-color property, though they often discuss vari...
متن کاملOn the non-optimality of four color coding of image partitions
Recent interest in region based image coding has given rise to graph coloring based partition encoding methods. These methods are based on the four color theorem for planar graphs, and assume that a coloring for a graph with the minimum possible number of colors will result in the most compressible representation. In this paper we show that this assumption is wrong. We show that there exist gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1610.01865 شماره
صفحات -
تاریخ انتشار 2016